Theoretical Analysis of Initial Particle Swarm Behavior

نویسندگان

  • Sabine Helwig
  • Rolf Wanka
چکیده

In this paper, particle trajectories of PSO algorithms in the first iteration are studied. We will prove that many particles leave the search space at the beginning of the optimization process when solving problems with boundary constraints in high-dimensional search spaces. Three different velocity initialization strategies will be investigated, but even initializing velocities to zero cannot prevent this particle swarm explosion. The theoretical analysis gives valuable insight into PSO in highdimensional bounded spaces, and highlights the importance of bound handling for PSO: As many particles leave the search space in the beginning, bound handling strongly influences particle swarm behavior. Experimental investigations confirm the theoretical results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient approach for availability analysis through fuzzy differential equations and particle swarm optimization

This article formulates a new technique for behavior analysis of systems through fuzzy Kolmogorov's differential equations and Particle Swarm Optimization. For handling the uncertainty in data, differential equations have been formulated by Markov modeling of system in fuzzy environment. First solution of these derived fuzzy Kolmogorov's differential equations has been found by Runge-Kutta four...

متن کامل

Quantum-Behaved Particle Swarm Optimization: Analysis of Individual Particle Behavior and Parameter Selection

Quantum-behaved particle swarm optimization (QPSO), motivated by concepts from quantum mechanics and particle swarm optimization (PSO), is a probabilistic optimization algorithm belonging to the bare-bones PSO family. Although it has been shown to perform well in finding the optimal solutions for many optimization problems, there has so far been little analysis on how it works in detail. This p...

متن کامل

Suppression of Chaotic Behavior in Duffing-holmes System using Backstepping Controller Optimized by Unified Particle Swarm Optimization Algorithm

The nonlinear behavior analysis and chaos control for Duffing-Holmes chaotic system is discussed in the paper. In order to suppress the irregular chaotic motion, an optimal backstepping controller is designed. The backstepping method consists of parameters with positive values. The improper selection of the parameters leads to inappropriate responses or even may lead to instability of the syste...

متن کامل

Dynamic system analysis and initial particles position in Particle Swarm Optimization

This paper focuses on a solution technique for global optimization problems, where the objective function value is possibly computed by the numerical solution of a PDE system. The nature of these optimization problems is that of a ‘blackbox’ type, where expensive simulations provide information to the optimizer, and each function evaluation could require several CPU-hours. The paper considers t...

متن کامل

A particle swarm optimization algorithm for minimization analysis of cost-sensitive attack graphs

To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008